Minimal diagrams of classical knots

نویسنده

  • Vassily Olegovich Manturov
چکیده

We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms and knots.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Surface Representations of Virtual Knots and Links

Equivalence classes of virtual knot diagrams are in a one to one correspondence with knot diagrams (decorated immersions of S1) in orientable, closed surfaces modulo stable handle equivalence and Reidemeister moves. Each virtual knot diagram corresponds to a diagram in a unique minimal surface. If a virtual knot diagram is equivalent to a classical knot diagram then this minimal surface is a sp...

متن کامل

Minimal diagrams of virtual links: II

In the present paper we bring together minimality conditions proposed in papers [10, 11] and present some new minimality conditions for classical and virtual knots and links.

متن کامل

A Partial Ordering of Knots Through Diagrammatic Unknotting

In this paper we define a partial order on the set of all knots and links using a special property derived from their minimal diagrams. A knot or link K′ is called a predecessor of a knot or link K if Cr(K′) < Cr(K) and a diagram of K′ can be obtained from a minimal diagram D of K by a single crossing change. In such a case we say that K′ < K. We investigate the sets of knots that can be obtain...

متن کامل

Quasi-alternating Links and Odd Homology: Computations and Conjectures

We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples of quasi-alternating knots and links with at least two different minimal diagrams, where one is quasi-alternating and the other is not. We provide examples ...

متن کامل

On the unknotting number of minimal diagrams

Answering negatively a question of Bleiler, we give examples of knots where the difference between minimal and maximal unknotting number of minimal crossing number diagrams grows beyond any extent.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005